An Attempt to Design a Better Algorithm for the Uncapacitated Facility Location Problem

نویسنده

  • Haotian Jiang
چکیده

The uncapacitated facility location has always been an important problem due to its connection to operational research and infrastructure planning. Byrka obtained an algorithm that is parametrized by γ and proved that it is optimal when γ > 1.6774. He also proved that the algorithm achieved an approximation ratio of 1.50. A later work by Shi Li achieved an approximation factor of 1.488. In this research, we studied these algorithms and several related works. Although we didn’t improve upon the algorithm of Shi Li, our work did provide some insight into the problem. We also reframed the problem as a vector game, which provided a framework to design balanced algorithms for this problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

متن کامل

A realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm

In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...

متن کامل

Genetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure

A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...

متن کامل

An Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption

Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability o...

متن کامل

حل مساله مکان‌یابی پایانه‌های شبکه اتوبوس‌رانی درون‌شهری با استفاده از الگوریتم ژنتیک

Bus network design is an important problem in public transportation. The main step to this design, is determining the number of required terminals and their locations. This is an especial type of facility location problem, a large scale combinatorial optimization problem that requires a long time to be solved. Branch & bound and simulated annealing methods have already been used for solving Urb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1610.07434  شماره 

صفحات  -

تاریخ انتشار 2016